Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins

نویسندگان

  • Karl Aberer
  • Anwitaman Datta
  • Manfred Hauswirth
چکیده

This paper presents and evaluates uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHTbased peer-to-peer systems. We compare our approach with the classical balls into bins model, and point out both the similarities as well as the differences which call for new load-balancing mechanisms specifically targeted at P2P systems. Some of the peculiarities of P2P systems, which make our problem challenging are that both the network membership and the data indexed in the network are dynamic, there is neither global coordination nor global information to rely on, and the load-balancing mechanism ideally should not compromise the structural properties and thus the search efficiency of the DHT, while preserving the semantic information of the data (e.g., lexicographic ordering to enable range

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Load Shedding

1. Aberer K., Datta A., Hauswirth M., and Schmidt R. Indexing data-oriented overlay networks. In Int. Conf. on Very Large Data Bases (VLDB 2005). (More details at http://www.pgrid.org) 2. Aberer K., Datta A., and Hauswirth M. Multifaceted simultaneous load balancing in DHT-based P2P systems: a new game with old balls and bins. In Self-Properties in Complex Information Systems, Springer, Berlin,...

متن کامل

An Adaptive and Dynamic Load Balancing Algorithm for Structured P2P Systems

One important issue in the DHT design is how to balance the load across the nodes in the system. To achieve load balance, existing DHT-based P2P systems simply resort to the hash function to map objects to nodes randomly. However, the use of DHT and the heterogeneity of nodes capacities may give rise to load imbalance problems, and affect the DHT system efficiency as well. A new load balance al...

متن کامل

Load Balancing Scheme on the Basis of Huffman Coding for P2P Information Retrieval

Although a distributed index on a distributed hash table (DHT) enables efficient document query processing in Peer-to-Peer information retrieval (P2P IR), the index costs a lot to construct and it tends to be an unfair management because of the unbalanced term frequency distribution. We devised a new distributed index, named Huffman-DHT, for P2P IR. The new index uses an algorithm similar to Hu...

متن کامل

Quantum Sampling for Balanced Allocations

It is known that the original Grover Search (GS) can be modified to use a general value for the phase θ of the diffusion transform. Then, if the number of answers is relatively large, this modified GS can find one of the answers with probability one in a single iteration. However, such a quick and error-free GS can only be possible if we can initially adjust the value of θ correctly against the...

متن کامل

Advanced Algorithm Design: Load Balancing

During last lecture, we showed that using the simple randomized strategy when assigning n balls to n bins, max load = O log n log log n. We now consider a more intelligent strategy of assigning balls to bins and show that it results in a suprising improvement over the above result. 1.1 Power of two choices In our new strategy, we choose two bins uniformly at random and place the ball in the bin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005